Some parameters of graph and its complement
نویسندگان
چکیده
منابع مشابه
Some Graph Polynomials of the Power Graph and its Supergraphs
In this paper, exact formulas for the dependence, independence, vertex cover and clique polynomials of the power graph and its supergraphs for certain finite groups are presented.
متن کاملextraction and acetylation of purified trypsin from bovin pancreas and study of some its physico-chemical properties
آنزیم تریپسین در شرایط قلیایی ناپایدار می باشد .و فعالیت پروتئولیتیکی تریپسین منجربه خود هضمی آن در جایگاههای خاصی می گردد. بنابر این آنزیمی با ناپایداری بالا محسوب میگردد. در سالهای اخیر موفق شدند که با ایجاد تغیرات شیمیایی با اضافه کردن فلزات خاص ، کلسیم و یا عمل استیلاسیون منجر به افزایش پایداری آنزیم تریپسین گردند. مطالعات در حال حاضر نشان می دهد که تریپسین استیله شده فعالیت آنزیمی خود را ...
15 صفحه اولSOME RESULTS ON THE COMPLEMENT OF THE INTERSECTION GRAPH OF SUBGROUPS OF A FINITE GROUP
Let G be a group. Recall that the intersection graph of subgroups of G is an undirected graph whose vertex set is the set of all nontrivial subgroups of G and distinct vertices H,K are joined by an edge in this graph if and only if the intersection of H and K is nontrivial. The aim of this article is to investigate the interplay between the group-theoretic properties of a finite group G and the...
متن کاملSOME GRAPH PARAMETERS ON THE COMPOSITE ORDER CAYLEY GRAPH
In this paper, the composite order Cayley graph Cay(G, S) is introduced, where G is a group and S is the set of all composite order elements of G. Some graph parameters such as diameter, girth, clique number, independence number, vertex chromatic number and domination number are calculated for the composite order Cayley graph of some certain groups. Moreover, the planarity of composite order Ca...
متن کاملOn the Connectivity of a Graph and its Complement Graph
In this paper, we study the connectivity of the complement of a graph. We first establish a simple formula to compute the connectivity of a graph that comes from the join of graphs. Base on this formula, we give an upper and a lower bound to the connectivity of the complement of a graph. Keyword: connectivity, complement, join, vertex of attachment.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1987
ISSN: 0012-365X
DOI: 10.1016/0012-365x(87)90142-7